The furthest-site geodesic voronoi diagram
نویسندگان
چکیده
منابع مشابه
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon
Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O(n log log n+m logm)time algorithm to compute the geodesic farthest-point Voronoi diagram of m point sites in a simple n-gon. This i...
متن کاملComputing Geodesic Furthest Neighbors in Simple Polygons
An algorithm is presented for computing geodesic furthest neighbors for all the vertices of a simple polygon, where geodesic denotes the fact that distance between two points of the polygon is defined as the length of an Euclidean shortest path connecting them within the polygon. The algorithm runs in O(n log n) time and uses O(n) space; n being the number of vertices of the polygon. As a corol...
متن کاملThe Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon
Given a set of sites (points) in a simple polygon, the farthest-point geodesic Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O((n + m) log logn)time algorithm to compute the farthest-point geodesic Voronoi diagram for m sites lying on the boundary of a si...
متن کاملA Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon
The geodesic Voronoi diagram ofm point sites inside a simple polygon of n vertices is a subdivision of the polygon into m cells, one to each site, such that all points in a cell share the same nearest site under the geodesic distance. The best known lower bound for the construction time is Ω(n+m logm), and a matching upper bound is a long-standing open question. The state-of-theart construction...
متن کاملTime - Based Voronoi Diagram ∗
We consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of points in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given point in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1993
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02189321